analytic algorithm

См. также в других словарях:

• analytic geometry — a branch of mathematics in which algebraic procedures are applied to geometry and position is represented analytically by coordinates. Also called coordinate geometry. [1820 30] * * * Investigation of geometric objects using coordinate systems.… …   Universalium

• Method of analytic tableaux — A graphical representation of a partially built propositional tableau In proof theory, the semantic tableau (or truth tree) is a decision procedure for sentential and related logics, and a proof procedure for formulas of first order logic. The… …   Wikipedia

• Kahan summation algorithm — In numerical analysis, the Kahan summation algorithm (also known as compensated summation) significantly reduces the numerical error in the total obtained by adding a sequence of finite precision floating point numbers, compared to the obvious… …   Wikipedia

• Jacobi eigenvalue algorithm — The Jacobi eigenvalue algorithm is a numerical procedure for the calculation of all eigenvalues and eigenvectors of a real symmetric matrix. Description Let varphi in mathbb{R}, , 1 le k < l le n and let J(varphi, k, l) denote the n imes n matrix …   Wikipedia

• Gauss–Legendre algorithm — The Gauss–Legendre algorithm is an algorithm to compute the digits of pi;. It is notable for being rapidly convergent, with only 25 iterations producing 45 million correct digits of pi;. However, the drawback is that it is memory intensive and it …   Wikipedia

• Eigenvalue algorithm — In linear algebra, one of the most important problems is designing efficient and stable algorithms for finding the eigenvalues of a matrix. These eigenvalue algorithms may also find eigenvectors. Contents 1 Characteristic polynomial 2 Power… …   Wikipedia

• Bach's algorithm — is a probabilistic polynomial time algorithm for generating random numbers along with their factorization, named after its discoverer, Eric Bach. It is of interest because no algorithm is known that efficiently factors numbers, so the… …   Wikipedia

• Odlyzko–Schönhage algorithm — In mathematics, the Odlyzko–Schönhage algorithm is a fast algorithm for evaluating the Riemann zeta function at many points, introduced by (Odlyzko Schönhage 1988). The key point is the use of the fast Fourier transform to speed up the… …   Wikipedia

• Lehmer-Schur algorithm — In mathematics, the Lehmer Schur algorithm is a root finding algorithm extending the one dimensional bracketing used by the bisection method to find the roots of a function of one complex variable inside any rectangular region of the function s… …   Wikipedia

• Big Five personality traits — Psychology …   Wikipedia

• Number theory — A Lehmer sieve an analog computer once used for finding primes and solving simple diophantine equations. Number theory is a branch of pure mathematics devoted primarily to the study of the integers. Number theorists study prime numbers (the… …   Wikipedia